#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include "Vector.h"
#include<math.h>
using namespace std;


//ANS:The most suitable SPARE_CAPACITY is N due to the same posibility of the distribution of size


int main(){
    int SPARE_CAPACITY;
    int inf=1,sup,size,remained_size;
    double epsilon=0.1;
    //to state that the supremum of SPARE_CAPACITY=sup size
    Vector<int> V;
    cout<<"Enter an integer which means to the supremum of the size of vector:";
    cin>>sup;
    size=inf+rand()%sup;
    remained_size=sup-size;
    SPARE_CAPACITY=size+remained_size;
    if ((SPARE_CAPACITY>=sup)&&fabs((SPARE_CAPACITY-sup))<epsilon){
        SPARE_CAPACITY=sup;
    }
    cout<<"The most suitable SPARE_CAPACITY is "<<SPARE_CAPACITY<<endl;

    return 0;
}
    
    

